A random-walk pseudorandom byte generator

Mission Impossible: Find a Random Pseudorandom Number Generator

In this column, we present some practical aspects about constructing a new test bench for random number sequences. The tests are based on two commonly used physical models in studies of statistical mechanics, namely the two{dimensional Ising spin model and random walks. We illustrate by a few examples the sensitivity of the tests by showing their ability to nd rather weak correlations in some c...

Design and Analysis of /dev/random, a Pseudorandom Number Generator

The ability to produce random numbers is an important aspect of many cryptographic applications. This document examines a method of constructing an algorithm that behaves in a non-deterministic manner in order to produce unpredictable outputs. Specifically, this paper examines the design of the pseudo random number generator /dev/random. 1 PRNG’s and the importance of randomness In many cryptog...

A Random Walk with Exponential Travel Times

Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...

MUGI Pseudorandom Number Generator

On a nonlinear congruential pseudorandom number generator

A nonlinear congruential pseudorandom number generator with modulus M = 2w is proposed, which may be viewed to comprise both linear as well as inversive congruential generators. The condition for it to generate sequences of maximal period length is obtained. It is akin to the inversive one and bears a remarkable resemblance to the latter.